Lidar Obstacle Detection
Compiling and Testing
Criteria | Meet Specification |
---|---|
The submission must compile. |
The project code must compile without errors using
|
Obstacle Detection
Criteria | Meet Specification |
---|---|
Bounding boxes enclose appropriate objects. |
Bounding boxes enclose vehicles, and the pole on the right side of the vehicle. There is one box per detected object. |
Objects are consistently detected across frames in the video. |
Most bounding boxes can be followed through the lidar stream, and major objects don't lose or gain bounding boxes in the middle of the lidar stream. |
Segmentation is implemented in the project. |
The code used for segmentation uses the 3D RANSAC algorithm developed in the course lesson. |
Clustering is implemented in the project. |
The code used for clustering uses the Euclidean clustering algorithm along with the KD-Tree developed in the course lesson. |
Code Efficiency
Criteria | Meet Specification |
---|---|
The methods in the code should avoid unnecessary calculations. |
Your code does not need to sacrifice comprehension, stability, or robustness for speed. However, you should maintain good and efficient coding practices when writing your functions. Here are some things to avoid. This is not a complete list, but there are a few examples of inefficiencies.
|